-
1 well ordered subset
Математика: вполне упорядоченное подмножество -
2 well ordered subset
-
3 subset
1) телефон. абонентский аппарат2) подгруппа3) подкласс4) подмножество5) полукомплект•- almost open subset - almost unitary subset - bounded below subset - countably paracompact subset - everywhere dense subset - linearly independent subset - locally closed subset - locally polyhedral subset - locally tame subset - nonvoid subset - polynomially convex subset - potentially invertible subset - relatively compact subset - relatively pseudocompact subset - right perfect subset - right unitary subset - strongly dependent subset - strongly positive subset - totally ordered subset - uniformly integrable subset - universally measurable subset - weakly bounded subset - weakly closed subset - weakly invariant subset - weak-star closed subset - well ordered subset - well separated subset -
4 relation
1) зависимость, (взаимо)связь2) отношение; соотношение4) геол. условия залегания•- almost universal relation - cause-effect relation - generalized semigroup relation - logically irreducible relation - parametrically definable relation - partial ordering relation - recursively enumerable relation - recursively invariant relation - recursively representable relation - strongly definable relation - weakly symmetric relation
См. также в других словарях:
well-ordered — adjective Date: 1589 1. having an orderly procedure or arrangement < a well ordered household > 2. partially ordered with every subset containing a first element and exactly one of the relationships “greater than”, “less than”, or “equal to”… … New Collegiate Dictionary
well-ordered set — Math. a totally ordered set in which every nonempty subset has a smallest element with the property that there is no element in the subset less than this smallest element. Cf. partially ordered set, totally ordered set. * * * … Universalium
well-ordered set — Math. a totally ordered set in which every nonempty subset has a smallest element with the property that there is no element in the subset less than this smallest element. Cf. partially ordered set, totally ordered set … Useful english dictionary
Well-ordering principle — In mathematics, the well ordering principle states that every non empty set of positive integers contains a smallest element. [cite book |title=Introduction to Analytic Number Theory |last=Apostol |first=Tom |authorlink=Tom M. Apostol |year=1976… … Wikipedia
Well-order — In mathematics, a well order relation (or well ordering) on a set S is a total order on S with the property that every non empty subset of S has a least element in this ordering.Equivalently, a well ordering is a well founded total order.The set… … Wikipedia
Ordered set — In order theory in mathematics, a set with a binary relation R on its elements that is reflexive (for all a in the set, aRa), antisymmetric (if aRb and bRa, then a = b) and transitive (if aRb and bRc, then aRc) is described as a… … Wikipedia
Ordered pair — In mathematics, an ordered pair (a, b) is a pair of mathematical objects. In the ordered pair (a, b), the object a is called the first entry, and the object b the second entry of the pair. Alternatively, the objects are called the first and… … Wikipedia
Well-founded relation — In mathematics, a binary relation, R, is well founded (or wellfounded) on a class X if and only if every non empty subset of X has a minimal element with respect to R; that is, for every non empty subset S of X, there is an element m of S such… … Wikipedia
Partially ordered set — The Hasse diagram of the set of all subsets of a three element set {x, y, z}, ordered by inclusion. In mathematics, especially order theory, a partially ordered set (or poset) formalizes and generalizes the intuitive concept of an ordering,… … Wikipedia
Formal power series — In mathematics, formal power series are devices that make it possible to employ much of the analytical machinery of power series in settings that do not have natural notions of convergence. They are also useful, especially in combinatorics, for… … Wikipedia
Cardinal function — In mathematics, a cardinal function (or cardinal invariant) is a function that returns cardinal numbers. Contents 1 Cardinal functions in set theory 2 Cardinal functions in topology 2.1 Basic inequalities … Wikipedia
